Generalized Grover Database Search Operator with Arbitrary Initial State
نویسندگان
چکیده
Abstract. In this paper we present a generalized description of the Grover operator, employed in a quantum database search algorithm. Our purpose is to employ an operator to find the proper solution(s) originated from an arbitrary initial state in the two dimensional vector space, where the orthogonal basis vector system are rotated in such a way where the result is obtained with a probability of error is very close to zero. Furthermore, we also stress to get the result –if it is possible– by a single try.
منابع مشابه
Grover’s quantum search algorithm for an arbitrary initial mixed state
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and sho...
متن کاملGeneralized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
Grover’s algorithm for quantum searching of a database is generalized to deal with arbitrary initial amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the r marked and N − r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T ∼ O( √ N/r) is derived which is shown to depend only...
متن کاملA General SU (2) Formulation for Quantum Searching with Certainty
A general quantum search algorithm with arbitrary unitary transformations and an arbitrary initial state is considered in this work. To serach a marked state with certainty, we have derived, using an SU(2) representation: (1) the matching condition relating the phase rotations in the algorithm, (2) a concise formula for evaluating the required number of iterations for the search, and (3) the fi...
متن کاملGeneralized Quantum Search Hamiltonian
There are hamiltonians that solve a search problem of finding one of N items in O( √ N) steps. They are hamiltonians to describe an oscillation between two states. In this paper we propose a generalized search hamiltonian, Hg. Then the known search hamiltonians become special cases of Hg. From the generalized search hamiltonian, we present remarkable results that searching with 100% is subject ...
متن کاملQuantum Database Searching by a Single Query
In this paper we give a quantum mechanical algorithm that can search a database by a single query, when the number of solutions is more than a quarter. It utilizes modified Grover operator of arbitrary phase.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003